Scheduling parameter sweep applications on global Grids: a deadline and budget constrained cost-time optimization algorithm

نویسندگان

  • Rajkumar Buyya
  • M. Manzur Murshed
  • David Abramson
  • Srikumar Venugopal
چکیده

1Grid Computing and Distributed Systems Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Parkville, Melbourne, VIC 3010, Australia 2Gippsland School of Computing and Information Technology, Monash University, Gippsland Campus, Churchill, VIC 3842, Australia 3School of Computer Science and Software Engineering, Monash University, Caulfield Campus, Melbourne, VIC 3145, Australia

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Deadline and Budget Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids

Computational Grids and peer-to-peer (P2P) networks enable the sharing, selection, and aggregation of geographically distributed resources for solving large-scale problems in science, engineering, and commerce. The management and composition of resources and services for scheduling applications, however, becomes a complex undertaking. We have proposed a computational economy framework for regul...

متن کامل

Economic-based Distributed Resource Management and Scheduling for Grid Computing

Grid computing, emerging as a new paradigm for next-generation computing, enables the sharing, selection, and aggregation of geographically distributed heterogeneous resources for solving large-scale problems in science, engineering, and commerce. The resources in the Grid are heterogeneous and geographically distributed. Availability, usage and cost policies vary depending on the particular us...

متن کامل

A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids

In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing datasets. The algorithm takes into account the explosion of choices that result due to a job requiring multiple datasets from multiple data sources. The algorithm builds a resource set for a job that mi...

متن کامل

A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm

In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...

متن کامل

A novel deadline and budget constrained scheduling heuristics for computational grids

The conventional deadline and budget constrained (DBC) scheduling heuristics for economic-based computational grids does not take the inconsistency of grid heterogeneity into account, which can lead to decline of application completion ratios. Motivated by this fact, a novel DBC scheduling heuristics was proposed to deal with sequential workflow applications. In order to valuate the inconsisten...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Softw., Pract. Exper.

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2005